Work on the machine-understanding of real texts, such as newspaper stories, has tended to be done either entirely by semantic means (conceptual analyzers, word expert parsers) or with a staged approach first using syntactic processing (part of speech analysis plus traditional or statistical parsing) and then phrase by phrase semantic analysis. The first technique has difficult problems in control structure and can miss the obvious; the second has almost insurmountable problems with structural ambiguity during its parsing phase and must often fall back on statistical methods and good guesses.
We present a technique for natural language understanding that is anchored in a lexically-driven syntactic analysis based on semantic grammars. It solves the control problem by constructing its primary grammar through the application of syntactically principled schemas using Tree Adjoining Grammar. Additional default rules of syntactic combination are also allowed when the validity of the combination is undeniable and the semantic interpretation of the new phrase is always the same, as with auxiliary verbs, relative pronouns, and the like.
We discuss recent developments in our work, where a richer model of semantic composition allows us to have more of the work done by the syntactic default rules without having to anticipate the semantic interpretation of a particular pair constituents while still yielding a specific, object-oriented model of the information in the understood text.
[1]
Charles Eugene Martin,et al.
Direct memory access parsing
,
1992
.
[2]
James Pustejovsky,et al.
The Generative Lexicon
,
1995,
CL.
[3]
David D. McDonald.
An Efficient Chart-based Algorithm for Partial-Parsing of Unrestricted Texts
,
1992,
ANLP.
[4]
Masaru Tomita,et al.
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
,
1985
.
[5]
David D. Mcdonald.
The Interplay of Syntactic and Semantic Node Labels in Partial Parsing
,
1993,
IWPT.
[6]
R R Burton,et al.
Toward a natural-language capability for computer-assisted instruction
,
1986
.
[7]
Aravind K. Joshi,et al.
Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?
,
1985
.
[8]
Steven L. Small,et al.
Viewing Word Expert Parsing as Linguistic Theory
,
1981,
IJCAI.
[9]
H. Alshawi,et al.
The Core Language Engine
,
1994
.
[10]
Aravind K. Joshi,et al.
Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars
,
1988,
COLING.
[11]
Naomi Sager,et al.
Natural Language Information Processing: A Computer Grammar of English and Its Applications
,
1980
.
[12]
Gary G. Hendrix,et al.
Developing a natural language interface to complex data
,
1977,
TODS.