An assumptive logic programming methodology for parsing

Vancouver, British Columbia, Canada November 13-November 15

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/TAI.2000.889840

12th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by K. Voll Articles by T. Yeh Articles by V. Dahl

	ASCII Text	x
	K. Voll, T. Yeh, V. Dahl, "An assumptive logic programming methodology for parsing," Tools with Artificial Intelligence, IEEE International Conference on, pp. 0011, 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000.

	BibTex	x
	@article{ 10.1109/TAI.2000.889840, author = {K. Voll and T. Yeh and V. Dahl}, title = {An assumptive logic programming methodology for parsing}, journal ={Tools with Artificial Intelligence, IEEE International Conference on}, volume = {0}, year = {2000}, isbn = {0-7695-0909-6}, pages = {0011}, doi = {http://doi.ieeecomputersociety.org/10.1109/TAI.2000.889840}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Tools with Artificial Intelligence, IEEE International Conference on TI - An assumptive logic programming methodology for parsing SN - 0-7695-0909-6 SP EP A1 - K. Voll, A1 - T. Yeh, A1 - V. Dahl, PY - 2000 KW - logic programming; DATALOG; grammars; theorem proving; assumptive logic programming methodology; AI; continuation based linear assumptions; timeless assumptions; datalog grammars; terse treatments; language processing phenomena; proof of concept; concise parser; logic grammars; numbered word boundaries; left-corner parsing; charting; test cases; constituent coordination; error diagnosis; error correction VL - 0 JA - Tools with Artificial Intelligence, IEEE International Conference on ER -

K. Voll, Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

T. Yeh, Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

V. Dahl, Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

Abstract: We show how several novel tools in logic programming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.

Index Terms:

logic programming; DATALOG; grammars; theorem proving; assumptive logic programming methodology; AI; continuation based linear assumptions; timeless assumptions; datalog grammars; terse treatments; language processing phenomena; proof of concept; concise parser; logic grammars; numbered word boundaries; left-corner parsing; charting; test cases; constituent coordination; error diagnosis; error correction

Citation:

K. Voll, T. Yeh, V. Dahl, "An assumptive logic programming methodology for parsing," ictai, pp.0011, 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.