Abstract
We show that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism
| Original language | English |
|---|---|
| Book series | Lecture Notes in Computer Science |
| Pages (from-to) | 170-181 |
| ISSN | 0302-9743 |
| Publication status | Published - 2009 |
| Event | Logic, Language, Information and Computation. 16th International Workshop, WoLLIC 2009 - Tokyo, Japan Duration: 21 Jun 2009 → 24 Jun 2009 Conference number: 10 |
Conference
| Conference | Logic, Language, Information and Computation. 16th International Workshop, WoLLIC 2009 |
|---|---|
| Number | 10 |
| Country | Japan |
| City | Tokyo |
| Period | 21/06/2009 → 24/06/2009 |
Keywords
- logic grammars
- abduction
Cite this
}
Abductive Logic Grammars. / Christiansen, Henning; Dahl, Veronica.
In: Lecture Notes in Computer Science, 2009, p. 170-181.Research output: Contribution to journal › Conference article › Research › peer-review
TY - GEN
T1 - Abductive Logic Grammars
AU - Christiansen, Henning
AU - Dahl, Veronica
N1 - Volumne: 5514
PY - 2009
Y1 - 2009
N2 - By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting. We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from the norm -- arbitrary (i.e., order-independent) derivations. We show that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism
AB - By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting. We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from the norm -- arbitrary (i.e., order-independent) derivations. We show that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism
KW - logiske grammatikker
KW - abduktion
KW - logic grammars
KW - abduction
M3 - Conference article
SP - 170
EP - 181
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -