Large-scale Complex Question Answering
LC-QuAD v1.0 and v2.0 are large-scale QA datasets towards complex questions against knowledge graphs.
Table of contents
LC-QuAD v1
The Largescale Complex Question Answering Dataset 1.0 (LC-QuAD 1.0)[1] is a Question Answering dataset with 5000 pairs of question and its corresponding SPARQL query. The target knowledge base is DBpedia, specifically, the April, 2016 version. Please see the original paper for details about the dataset creation process and framework.
This dataset can be downloaded via the link.
Leaderboard
| Model / System | Year | Precision | Recall | F1 | Language | Reported by |
|---|---|---|---|---|---|---|
| mBERT | 2021 | 73 | - | 85.50 | EN | Zhou Y. et al |
| Stage-I No Noise | 2021 | 83.11 | 83.04 | 83.08 | EN | Purkayastha et al. |
| mBERT | 2021 | - | - | 82.40 | DE | Zhou Y. et al |
| LAMA | 2019 | - | - | 81.60 | EN | Radoev et. al. |
| mBERT | 2021 | - | - | 80.90 | NL | Zhou Y. et al |
| mBERT | 2021 | - | - | 76.10 | ES | Zhou Y. et al |
| HGNet | 2021 | 75.82 | 75.22 | 75.10 | EN | Chen et al. |
| O-Ranking | 2021 | 75.54 | 74.95 | 74.81 | EN | Chen et al. |
| AQG-net | 2021 | - | - | 74.80 | EN | Chen et al. |
| mBERT | 2021 | - | - | 74.50 | RU | Zhou Y. et al |
| mBERT | 2021 | - | - | 74 | PT | Zhou Y. et al |
| mBERT | 2021 | - | - | 73.20 | FR | Zhou Y. et al |
| mBERT | 2021 | - | - | 72.60 | RO | Zhou Y. et al |
| mBERT | 2021 | - | - | 72.30 | IT | Zhou Y. et al |
| DAM | 2021 | - | - | 72 | EN | Chen et al. |
| mBERT | 2021 | - | - | 71.90 | HI_IN | Zhou Y. et al |
| mBERT | 2021 | - | - | 71.70 | FA | Zhou Y. et al |
| Slot-Matching | 2021 | - | - | 71 | EN | Chen et al. |
| G Maheshwari et. al. Pairwise | 2019 | 66 | 77 | 71 | EN | G Maheshwari et. al. |
| G Maheshwari et. al. Pointwise | 2019 | 65 | 76 | 70 | EN | G Maheshwari et. al. |
| HR-BiLSTM | 2021 | - | - | 70 | EN | Chen et al. |
| S-Ranking | 2021 | 65.89 | 75.30 | 69.53 | EN | Chen et al. |
| STAGG | 2021 | - | - | 69 | EN | Chen et al. |
| Liang et al. | 2021 | 88 | 56 | 68 | EN | Liang et al. |
| STaG-QA_pre | 2021 | 74.50 | 54.80 | 53.60 | EN | Ravishankar et al. |
| STaG-QA | 2021 | 76.50 | 52.80 | 51.40 | EN | Ravishankar et al. |
| sparql-qa | 2021 | 49.50 | 49.20 | 49.10 | EN | M. Borroto et al |
| BART | 2021 | 48.01 | 49.19 | 47.62 | EN | Chen et al. |
| SYGMA | 2021 | 47 | 48 | 47 | EN | S Neelam et al |
| NHGG | 2021 | 46.93 | 48.36 | 46.12 | EN | Chen et al. |
| WDAqua-core1 | 2021 | 59 | 38 | 46 | EN | Liang et al. |
| NSQA | 2021 | 44.80 | 45.80 | 44.40 | EN | Ravishankar et al. |
| Stage-I Part Noise | 2021 | 42.40 | 42.26 | 42.33 | EN | Purkayastha et al. |
| Stage-II w/ type | 2021 | 37.03 | 37.06 | 37.05 | EN | Purkayastha et al. |
| QASparql | 2021 | - | - | 34 | EN | Orogat et al. |
| DTQA | 2021 | 33.94 | 34.99 | 33.72 | EN | Abdelaziz et al. |
| QAmp | 2021 | 25 | 50 | 33.33 | EN | Purkayastha et al. |
| QAmp | 2021 | 25 | 50 | 33 | EN | Steinmetz et al. |
| QAmp | 2021 | 25 | 50 | 33 | EN | Abdelaziz et al. |
| QAmp | 2021 | 25 | 50 | 33 | EN | Ravishankar et al. |
| QAmp | 2021 | 25 | 50 | 33 | EN | Kapanipathi et al. |
| Stage-II w/o type | 2021 | 32.12 | 32.20 | 32.18 | EN | Purkayastha et al. |
| WDAqua-core1 | 2021 | 22 | 38 | 28 | EN | Abdelaziz et al. |
| WDAqua-core1 | 2021 | 22 | 38 | 28 | EN | Purkayastha et al. |
| WDAqua-core1 | 2021 | 22 | 38 | 28 | EN | Steinmetz et al. |
| WDAqua-core0 | 2021 | 22 | 38 | 28 | EN | Ravishankar et al. |
| Stage-I Full Noise | 2021 | 25.54 | 25.64 | 25.59 | EN | Purkayastha et al. |
| Frankenstein | 2021 | 20 | 21 | 20 | EN | Liang et al. |
| WDAqua-core0 | 2021 | - | - | 15 | EN | Orogat et al. |
| AskNow | 2021 | - | - | 11 | EN | Orogat et al. |
| Qanary(TM+DP+QB) | 2021 | - | - | 1 | EN | Orogat et al. |
LC-QuAD v2
The Largescale Complex Question Answering Dataset 2.0 (LC-QuAD 2.0)[2] is a Large Question Answering dataset with 30,000 pairs of question and its corresponding SPARQL query. The target knowledge base is Wikidata and DBpedia, specifically the 2018 version. Please see our paper for details about the dataset creation process and framework.
This dataset can be downloaded via the link.
Leaderboard
| Model / System | Year | Precision | Recall | F1 | Language | Reported by |
|---|---|---|---|---|---|---|
| Zou et al. + Bert | 2021 | - | - | 59.30 | EN | Zou et al. |
| Zou et al. + Tencent Word | 2021 | - | - | 52.90 | EN | Zou et al. |
| Multi-hop QGG | 2021 | - | - | 52.60 | EN | Zou et al. |
| AQG-net | 2021 | - | - | 44.90 | EN | Zou et al. |
| 5 | 2021 | 38.19 | 40.39 | 38.29 | EN | Kapanipathi et al. |
| ElNeuQA-ConvS2S [1] | 2021 | 26.90 | 27 | 26.90 | EN | Diomedi, Hogan |
| GRAFT-Net + Clocq [2] | 2022 | 19.70 | - | - | EN | Christmann P. et al |
- [1] discarded 2,502 (8.2%) of the 30,226 instances due to such quality issues..
- [2] 2k dev, 8k test, more complex questions from origical LC-QuAD 2.0.
LC-QuAD v2 + QALD-9
Leaderboard
| Model / System | Year | Precision | Recall | F1 | Language | Reported by |
|---|---|---|---|---|---|---|
| mBERT [1] | 2021 | - | - | 70 | PT_BR | Zhou Y. et al |
| mBERT [2] | 2021 | - | - | 66.7 | EN | Zhou Y. et. al. |
| mBERT [3] | 2021 | - | - | 65.9 | NL | Zhou Y. et al |
| mBERT [4] | 2021 | - | - | 63.6 | FR | Zhou Y. et al |
| mBERT [5] | 2021 | - | - | 63.5 | RU | Zhou Y. et al |
| mBERT [6] | 2021 | - | - | 63.5 | PT | Zhou Y. et al |
| mBERT [7] | 2021 | - | - | 62.6 | HI_IN | Zhou Y. et al |
| mBERT [8] | 2021 | - | - | 62.2 | DE | Zhou Y. et al |
| mBERT [9] | 2021 | - | - | 62.1 | RO | Zhou Y. et al |
| mBERT [10] | 2021 | - | - | 60 | FA | Zhou Y. et al |
| mBERT [11] | 2021 | - | - | 58.8 | ES | Zhou Y. et al |
| mBERT [12] | 2021 | - | - | 57.7 | IT | Zhou Y. et al |
- [1] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [2] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [3] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [4] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [5] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [6] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [7] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [8] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [9] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [10] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [11] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
- [12] trained on LC-QuAD 1.0, tested on a data combining qald4 -9 and filter out some out-of-scope questionss.
References
[1] Trivedi, Priyansh, Gaurav Maheshwari, Mohnish Dubey, and Jens Lehmann. Lc-quad: A corpus for complex question answering over knowledge graphs. In International Semantic Web Conference, pp. 210-218. Springer, Cham, 2017.
[2] Dubey, Mohnish, Debayan Banerjee, Abdelrahman Abdelkawi, and Jens Lehmann. Lc-quad 2.0: A large dataset for complex question answering over wikidata and dbpedia. In International semantic web conference, pp. 69-78. Springer, Cham, 2019.


WELCOME BROS! Are you ready to see who the better wingman is?
Start
Player 1: 0
Timer: 00
Player 2: 0
Category 1
Category 2
Category 3
100
100
100
300
300
300
500
500
500


Java Accessibility Guide
This guide contains the following sections:
- Enabling Accessibility: If you have a Java application that was designed for use with a Microsoft Windows assistive technology, see this section to enable Java Access Bridge.
- Programmer's Guides: If you want to develop accessible Java applications or assistive technology products that work in conjunction with Java applications, see this section.
Java Access Bridge is a technology that enables certain Java applications and applets to be visible to assistive technologies on Microsoft Windows systems. The following topics show you how to enable and test Java Access Bridge.


The lower and upper whiskers represent the bottom and top 25% of the responses, respectively. That means 25% of the respondents said that their annual household income is lower than $31,000 (lower whisker), and 25% of the respondents said that their annual household income is more than $40,000 (Upper whisker).
in-context


{% extends "base.html" %} {% block title %}Account Access Tokens{% endblock %} {% block content %}
These tokens allow you to give access to specific repositories. They are perfect if you need to pull down an image to a client's server without giving them access to all the repositories in your account.
| Token | Repository | Access | ||
|---|---|---|---|---|
{{ token.token }} |
{% if token.repository %}
{{ request.user.username }} / {{ token.repository.name }} | {% else %}All repositories | {% endif %} {% if token.access == "write" %}Read and Write | {% else %}Read | {% endif %}


C. Disposition to Victims of Natural Disaster
1. disposition for other than residential
or agricultural purposes
§171-85 Definitions. As used in this part III C:
"Disaster area" means an area proclaimed by the governor to be a disaster area.
"Natural disaster" means any disaster caused by seismic or tidal wave, tsunami, hurricane, volcanic eruption, typhoon, earthquake, or flood.
"Person" means an individual (citizen and noncitizen), partnership, corporation, and association. [L 1962, c 32, pt of §2; Supp, §103A-80; HRS §171-85]
Revision Note
Numeric designations deleted.


Mississippi Coast Marathon
Waveland MS/USA
Website: www.gulfcoastrunningclub.org
Race Winners
(29 runnings)
11
Nov
2007
25
Nov
2006
26
Nov
2005
27
Nov
2004
29
Nov
2003
30
Nov
2002
24
Nov
2001
25
Nov
2000
27
Nov
1999
28 Nov
1998
29 Nov
1997
30 Nov
1996
2:41:15
1995
--- ---
1994
--- ---
1993
--- ---
1992
--- ---
1991
--- ---
1990
--- ---
1989
--- ---
1988
--- ---
Notes: 1988 was the inaugural year.
25
Nov 2017
2:56:12
Max Garcia (USA)
3:28:21
Dana Vergunsk (USA)
26
Nov 2016
2:53:03
Sean Hicks (USA)
3:59:47
Kandra Hoyt (USA)
28
Nov 2015
3:16:28
Leonard Vergunst-7
3:23:59
Rebecca Bell (USA)
29
Nov 2014
2:59:10
Leonard Vergunst-6
3:46:49
Marguerite Mogul
(VA/USA)
30
Nov 2013
2:41:10
Nick Accardo (USA)
3:21:18
Cindy Lewandowski
(MN/USA)
24
Nov 2012
3:01:14
Leonard Vergunst-5
3:33:25
Khanh Le (USA)
26
Nov 2011
2:57:45
Ray Martinez (USA)
3:24:30
Grace Thacker (USA)
27
Nov 2010
2:50:40
Leonard Vergunst-4
3:30:40
Lauren Wilder (USA)
28
Nov 2009
2:49:31
Leonard Vergunst-3
3:19:02
Jennifer Vance (USA)
09 Nov
2008
2:45:43
Brandon Wingate-3
3:24:09
Denise Fairbanks (USA)
2:51:31
Leonard Vergunst-2
3:30:46
Theresa Novak (USA)
2:52:22
Kevin Tscholl (USA)
3:31:39
Megan Carlson (MO/USA)
2:49:25
Brendan Minihan (LA/USA)
3:42:00
Kristine Hup (USA)
2:51:34
Leonard Vergunst (MS/USA)
3:32:37
Leigh
Drye-2
2:50:51
Brandon Wingate-2
3:34:05
Leigh Drye (USA)
2:46:16
Brandon Wingate (USA)
3:44:38
Casey Rodgers (FL/USA)
2:52:07
Bryan
Smith-2
3:48:51
Jordan Tourney (NC/USA)
2:44:24
Bryan Smith (LA/USA)
3:41:01
Donna Thackway (USA)
2:46:43
Ross Shales (USA)
3:44:00
Mindy Weber (USA)
2:57:47
Bobby Aswell (NC/USA)
3:48:28
Lana Hayden (USA)
---
not held
---
not held
Alexander Thomas (LA/USA)
3:35:09
Sandy Lind (USA)
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
n/a
Most Wins
(1988/date)
Men
7
Leonard Vergunst (MS/USA)
2004,2007,2009-10,2012,2014-15
Women
2
Leigh Drye (USA)
2003-04
Prize Money
(ADR qualified runners)
No information on prize money has been received for this race.
Race Time Bias
(sec/km)
Insufficient data to calculate the race time bias.
Competitive Level
(1990-date)
Insufficient data to calculate the competitive level.
Quality Performances
Men No men under 2:20 Women No women under 2:50
Last Updated on 30 Nov 2017
Contributor: Klaas Loonstra (40)


Max Vilgalys
Economist, ERG
Previously, PhD at MIT Institute for Data, Systems, and Society
<EMAIL_ADDRESS>CV
things I'm proud of in my work
-
Estimating Continuous Treatment Effects in Panel Data using Machine Learning with an Agricultural Application (joint with Sylvia Klosin, 2022)
paper, slides, package, code available upon request -
Equity and Adaptation to Wildfire Risk: Evidence from California Public Safety Power Shutoffs (2022)
paper, code, data -
A Machine Learning Approach to Measuring Climate Adaptation (2023)
paper, code and data available upon request -
Essays on Measuring Climate Change Damages and Adaptation (2022)
thesis, individual chapters also above -
Analysis of coal plant performance in the western United States
paper, blog post, webinar, code -
Contributions to the US Department of Energy geothermal energy study
report 1 and report 2 -
Other Coding
and in my life
-
I biked across the country, listening and looking
blog post - I have a Spotify playlist with 19 followers


All Packages Class Hierarchy This Package Previous Next Index
Class BIT.highBIT.BasicBlock
java.lang.Object
|
+----BIT.highBIT.BasicBlock
- public class BasicBlock
- extends Object
- implements Cloneable
Represents a basic block.
Basic block is a section of code that has only one entry and exit point.
-
end_address
-
Represents the ending address (in # of instructions) of this basic block.
-
routine
- Represents the routine that this basic block is defined in.
-
start_address
-
Represents the start address (in # of instructions) of this basic block.
-
BasicBlock(Routine, int)
- Constructor for BasicBlock class.
-
addAfter(String, String, Object)
- Add a call to classname.methodname after this basic block.
-
addBefore(String, String, Object)
- Add a call to classname.methodname before this basic block.
-
clone()
-
-
getClassName()
-
-
getEndAddress()
- Returns the ending offset of this basic block.
-
getMethodName()
-
-
getOldEndAddress()
-
-
getOldStartAddress()
-
-
getStartAddress()
- Returns the starting offset of this basic block.
-
setEndAddress(int)
- This method is used to adjust the end address of a basic block
after insertion of instructions.
-
setStartAddress(int)
- This method is used to adjust the start address of a basic block
after insertion of instructions.
-
size()
- This method retuns the size of this basic block.
-
split(Routine, int)
- Splitting a BasicBlock.
start_address
protected int start_address
- Represents the start address (in # of instructions) of this basic block.
This value can be read by invoking getStart() method.
- See Also:
- getStart
end_address
protected int end_address
- Represents the ending address (in # of instructions) of this basic block.
This value can be read by invoking getEnd() method.
- See Also:
- getEnd
routine
public Routine routine
- Represents the routine that this basic block is defined in.
BasicBlock
public BasicBlock(Routine r,
int start)
- Constructor for BasicBlock class.
split
public void split(Routine r,
int inst_index)
- Splitting a BasicBlock.
getStartAddress
public int getStartAddress()
- Returns the starting offset of this basic block.
getOldStartAddress
public int getOldStartAddress()
setStartAddress
public void setStartAddress(int addr)
- This method is used to adjust the start address of a basic block
after insertion of instructions.
getEndAddress
public int getEndAddress()
- Returns the ending offset of this basic block.
getOldEndAddress
public int getOldEndAddress()
setEndAddress
public void setEndAddress(int addr)
- This method is used to adjust the end address of a basic block
after insertion of instructions.
size
public int size()
- This method retuns the size of this basic block.
addBefore
public void addBefore(String classname,
String methodname,
Object arg)
- Add a call to classname.methodname before this basic block.
addAfter
public void addAfter(String classname,
String methodname,
Object arg)
- Add a call to classname.methodname after this basic block.
clone
protected Object clone() throws CloneNotSupportedException
- Overrides:
- clone in class Object
getClassName
public String getClassName()
getMethodName
public String getMethodName()
All Packages Class Hierarchy This Package Previous Next Index


We would like to adopt another pet and are looking for one that is similar to what's shown in the picture.


--- layout: post title: The End of Convenience date: 2013-08-12 13:56:05.000000000 -04:00 type: post published: true status: publish categories: [] tags: - convenience - food meta: publicize_twitter_user: AnoSinPlastico _wpas_done_4291354: '1' _publicize_done_external: a:1:{s:7:"twitter";a:1:{i:1663781161;b:1;}} author: login: savebeandip email<EMAIL_ADDRESS>display_name: savebeandip first_name: '' last_name: '' ---
The end of convenience in modern society may sound scary. No more 7 11's...no more take out boxes...no more all-in-one trash bins. Nevertheless, it is a choice we must make, to limit our modern conveniences, if we wish to live a responsible and sustainable life.
It's not convenient to recycle. It's not convenient to bring your own container to the store. It's not convenient to take the stairs as opposed to the elevator. There's hundreds of decisions we make every day that are based on convenience, and many of these convenient choices are putting our world and society in a worse state than it was when we arrived.
Try riding a bike instead of driving. Pack your lunch instead of getting take out. Carry your empty plastic water bottle in your bag until you can recycle it. Better yet, always have a reusable water bottle and travel coffee mug so you don't ever use plastic bottles or styrofoam cups. I could go on and on about sacrificing conveniences in order to make our society, our money and our health more sustainable, but you get the idea. Now it's time to practice what I preach and take the stairs up to the 5th floor of my apartment instead of riding the elevator #already #wheezing.
Today I made a critical early decision in the year without plastic.  The quick and convenient solution to getting bagels is to say, "yes pick me up a bag". The very inconvenient solution is to go to the bakery and bring a container from home to put the bagels in. How awkward and inconvenient that interaction will be. I am looking forward to it. I look at it as a social experiment on convenience and the acceptance of environmentally friendly choices.