Search Results

Documents authored by Pinto, Alexandre

Found 2 Possible Name Variants:

Pinto, Alexandre

Document
DOI: 10.4230/OASIcs.SLATE.2016.3
Comparing the Performance of Different NLP Toolkits in Formal and Social Media Text

Authors: Alexandre Pinto, Hugo Gonçalo Oliveira, and Ana Oliveira Alves

Published in: OASIcs, Volume 51, 5th Symposium on Languages, Applications and Technologies (SLATE'16) (2016)

Abstract
Nowadays, there are many toolkits available for performing common natural language processing tasks, which enable the development of more powerful applications without having to start from scratch. In fact, for English, there is no need to develop tools such as tokenizers, part-of-speech (POS) taggers, chunkers or named entity recognizers (NER). The current challenge is to select which one to use, out of the range of available tools. This choice may depend on several aspects, including the kind and source of text, where the level, formal or informal, may influence the performance of such tools. In this paper, we assess a range of natural language processing toolkits with their default configuration, while performing a set of standard tasks (e.g. tokenization, POS tagging, chunking and NER), in popular datasets that cover newspaper and social network text. The obtained results are analyzed and, while we could not decide on a single toolkit, this exercise was very helpful to narrow our choice.
Cite as

Alexandre Pinto, Hugo Gonçalo Oliveira, and Ana Oliveira Alves. Comparing the Performance of Different NLP Toolkits in Formal and Social Media Text. In 5th Symposium on Languages, Applications and Technologies (SLATE'16). Open Access Series in Informatics (OASIcs), Volume 51, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{pinto_et_al:OASIcs.SLATE.2016.3,
  author =	{Pinto, Alexandre and Gon\c{c}alo Oliveira, Hugo and Oliveira Alves, Ana},
  title =	{{Comparing the Performance of Different NLP Toolkits in Formal and Social Media Text}},
  booktitle =	{5th Symposium on Languages, Applications and Technologies (SLATE'16)},
  pages =	{3:1--3:16},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-006-4},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{51},
  editor =	{Mernik, Marjan and Leal, Jos\'{e} Paulo and Gon\c{c}alo Oliveira, Hugo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2016.3},
  URN =		{urn:nbn:de:0030-drops-60086},
  doi =		{10.4230/OASIcs.SLATE.2016.3},
  annote =	{Keywords: Natural language processing, toolkits, formal text, social media, benchmark}
}

Pinto, Alexandre Miguel

Document
DOI: 10.4230/LIPIcs.ICLP.2010.134
Tight Semantics for Logic Programs

Authors: Luis Moniz Pereira and Alexandre Miguel Pinto

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)

Abstract
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence, even in face of Odd Loops Over Negation (OLONs) or infinite chains; relevance cumulativity; and compliance with the Well-Founded Model. When complete models are unnecessary, and top-down querying (à la Prolog) is desired, TS provides the 2-valued option that guarantees model existence, as a result of its relevance property. Top-down querying with abduction by need is rendered available too by TS. The user need not pay the price of computing whole models, nor that of generating all possible abductions, only to filter irrelevant ones subsequently. A TS model of a NLP P is any minimal model M of P that further satisfies P^---the program remainder of P---in that each loop in P^ has a MM contained in M, whilst respecting the constraints imposed by the MMs of the other loops so-constrained too. The applications afforded by TS are all those of Stable Models, which it generalizes, plus those permitting to solve OLONs for model existence, plus those employing OLONs for productively obtaining problem solutions, not just filtering them (like Integrity Constraints).
Cite as

Luis Moniz Pereira and Alexandre Miguel Pinto. Tight Semantics for Logic Programs. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 134-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{pereira_et_al:LIPIcs.ICLP.2010.134,
  author =	{Pereira, Luis Moniz and Pinto, Alexandre Miguel},
  title =	{{Tight Semantics for Logic Programs}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{134--143},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.134},
  URN =		{urn:nbn:de:0030-drops-25919},
  doi =		{10.4230/LIPIcs.ICLP.2010.134},
  annote =	{Keywords: Normal Logic Programs, Relevance, Cumulativity, Stable Models, Well-Founded Semantics, Program Remainder}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact