tbed-parser


Transformation-based learning for Semantic parsing

The Transformation-based Learning (TBL) parser implements a parser which competes with the HVS and EHVS parsers developed for the CUED dialogue act scheme.

More details about the parser can be found in the WIKI:

  1. Introduction
  2. Dialogue Act Scheme
  3. How use the parser
  4. Configuration of the experiment

More details about the parser how the parsing works can be found in this article (PDF) (poster).

If you plan to use the Extended Hidden Vector State Parser, I strongly suggest you to use this (TBL) parser. * First, the TBL parser does not depend on GMTK which is not maintained any more. * Second, the TBL parser make use of the database with lexical realizations of slot values. This makes the parser more robust and accurate. One can argue that this is extra information but the true is that real dialogue systems knows what the available slot values are. And most of the time the slot value is its own lexical realization. For example, think of slot value "Fountain Inn". Its lexical realization is "fountain inn". However, it might be also "fountain" or "inn". The last two lexical realization must be added in the database. You can also think about the words "fountain" or "inn" as synonyms for "fountain inn". * Third, the TBL parser is much faster. This is even more important for the real-time dialogue systems. * Finally, the TBL parser provides state-of-the-art results.


<wiki:gadget url="http://www.ohloh.net/projects/tbed-parser/widgets/project_languages.xml" height="240" width="420" border="1" />

Project Information

Labels:
Python transformation parser MachineLearning CUED semantics NLP