Hardware natural language interface

Pavlatos, C; Dimopoulos, AC; Papakonstantinou, G

dc.contributor.author	Pavlatos, C	en
dc.contributor.author	Dimopoulos, AC	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T02:44:38Z
dc.date.available	2014-03-01T02:44:38Z
dc.date.issued	2007	en
dc.identifier.issn	15715736	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31928
dc.subject	Field Programmable Gate Array	en
dc.subject	Hardware Implementation	en
dc.subject	Natural Language	en
dc.subject	Natural Language Interface	en
dc.subject	Natural Language Processing	en
dc.subject	Question Answering	en
dc.subject	Short Message Service	en
dc.title	Hardware natural language interface	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-0-387-74161-1_33	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-0-387-74161-1_33	en
heal.publicationDate	2007	en
heal.abstract	In this paper an efficient architecture for natural language processing is presented, implemented in hardware using FPGAs (Field Programmable Gate Arrays). The system can receive sentences belonging to a subset of Natural Languages (NL) from the internet or as SMS (Short Message Service). The recognition task of the input string uses Earley's parallel parsing algorithm and produces intermediate code according to the semantics of the grammar. The intermediate code can be transmitted to a computer, for further processing. The high computational cost of the parsing task in conjunction with a possible large amount of input sentences, to be processed simultaneously, justify the hardware implementation of the grammar (syntax and semantics). An extensive illustrative example is given from the area of question answering, in order to show the feasibility of the proposed system. © 2007 International Federation for Information Processing.	en
heal.journalName	IFIP International Federation for Information Processing	en
dc.identifier.doi	10.1007/978-0-387-74161-1_33	en
dc.identifier.volume	247	en
dc.identifier.spage	305	en
dc.identifier.epage	313	en