| 1 |
A Computational Grammar for Swedish Noun Phrases in a Natural Language Interface to Databases
|
|
|
|
In: http://stp.ling.uu.se/~matsd/thesis/arch/2002-003.ps (2002)
|
|
Abstract:
This thesis describes a computational grammar that analyzes Swedish noun phrases, and maps them to semantic representations. The noun phrase grammar is a component of the Swedish version of the Phoenix natural language interface to databases system which maps natural language questions to corresponding SQL queries. The coverage of the grammar is determined by the noun phrase part of a grammar specification for Swedish questions. Beside grammatical literature, a Wizard of Oz dialogue corpus has been used to investigate the grammatical phenomena supported by the grammar specification. An evaluation corpus has been compiled by randomly selecting questions from Internet FAQ:s about cellular phones, Internet banking and broadband connection. From these questions, noun phrases were extracted and supplied to the grammar. After manually examining the resulting semantic representations, it was found that 83% of a total of 254 noun phrases were given all the intended semantic representations, and only the intended semantic representations.
|
|
Keyword:
Computational grammars; Natural language interfaces to databases; Noun phrases; Question--Answering systems; Swedish grammar i
|
|
URL: http://stp.ling.uu.se/~matsd/thesis/arch/2002-003.ps
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7863
|
|
BASE
|
|
Hide details
|
|
|
| 2 |
A computational grammar for swedish noun phrases in a natural language interface to databases
|
|
|
|
In: http://stp.lingfil.uu.se/exarb/arch/2002-003.pdf (2002)
|
|
BASE
|
|
Show details
|
|
|
|
|
