SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Joakim Nivre)
 

Sökning: WFRF:(Joakim Nivre) > Automatic and unsup...

  • Bigert, Johnny,1976-KTH,Data- och systemvetenskap, DSV (författare)

Automatic and unsupervised methods in natural language processing

  • BokEngelska2005

Förlag, utgivningsår, omfång ...

  • Stockholm :KTH,2005
  • xi, 120 s.
  • electronicrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:kth-156
  • ISBN:9172839821
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-156URI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:vet swepub-contenttype
  • Ämneskategori:dok swepub-publicationtype

Serie

  • Trita-NA,0348-2952 ;2005:08

Anmärkningar

  • QC 20100901
  • Natural language processing (NLP) means the computer-aided processing of language produced by a human. But human language is inherently irregular and the most reliable results are obtained when a human is involved in at least some part of the processing. However, manual workis time-consuming and expensive. This thesis focuses on what can be accomplished in NLP when manual workis kept to a minimum. We describe the construction of two tools that greatly simplify the implementation of automatic evaluation. They are used to implement several supervised, semi-supervised and unsupervised evaluations by introducing artificial spelling errors. We also describe the design of a rule-based shallow parser for Swedish called GTA and a detection algorithm for context-sensitive spelling errors based on semi-supervised learning, called ProbCheck. In the second part of the thesis, we first implement a supervised evaluation scheme that uses an error-free treebankto determine the robustness of a parser when faced with noisy input such as spelling errors. We evaluate the GTA parser and determine the robustness of the individual components of the parser as well as the robustness for different phrase types. Second, we create an unsupervised evaluation procedure for parser robustness. The procedure allows us to evaluate the robustness of parsers using different parser formalisms on the same text and compare their performance. Five parsers and one tagger are evaluated. For four of these, we have access to annotated material and can verify the estimations given by the unsupervised evaluation procedure. The results turned out to be very accurate with few exceptions and thus, we can reliably establish the robustness of an NLP system without any need of manual work. Third, we implement an unsupervised evaluation scheme for spell checkers. Using this, we perform a very detailed analysis of three spell checkers for Swedish. Last, we evaluate the ProbCheck algorithm. Two methods are included for comparison: a full parser and a method using tagger transition probabilities. The algorithm obtains results superior to the comparison methods. The algorithm is also evaluated on authentic data in combination with a grammar and spell checker.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Kann, ViggoKTH,Data- och systemvetenskap, DSV (preses)
  • Nivre, joakimVäxjö universitet (opponent)
  • KTHData- och systemvetenskap, DSV (creator_code:org_t)

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Bigert, Johnny, ...
Kann, Viggo
Nivre, joakim
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
och Datavetenskap
Delar i serien
Trita-NA,
Av lärosätet
Kungliga Tekniska Högskolan

Sök utanför SwePub

Wikipedia om författaren:
Johnny_Bigert
Bigert, Johnny,1976-
en

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy