SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Kann Viggo) srt2:(2000-2004)"

Sökning: WFRF:(Kann Viggo) > (2000-2004)

  • Resultat 1-6 av 6
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Alimonti, P., et al. (författare)
  • Some APX-completeness results for cubic graphs
  • 2000
  • Ingår i: Theoretical Computer Science. - 0304-3975 .- 1879-2294. ; 237:2-Jan, s. 123-134
  • Tidskriftsartikel (refereegranskat)abstract
    • Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. Therefore, unless P = NP, these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded by three.
  •  
2.
  • Bigert, Johnny, et al. (författare)
  • Grammar checking for Swedish second language learners
  • 2004
  • Ingår i: CALL for the Nordic Languages. - Copenhagen Business School : Samfundslitteratur. - 8759311762 ; , s. 33-47
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • Grammar errors and context-sensitive spelling errors in texts written by second language learners are hard to detect automatically. We have used three different approaches for grammar checking: manually constructed error detection rules, statistical differences between correct and incorrect texts, and machine learning of specific error types. The three approaches have been evaluated using a corpus of second language learner Swedish. We found that the three methods detect different errors and therefore complement each other.
  •  
3.
  • Carlberger, Johan, et al. (författare)
  • The development and performance of a grammar checker for Swedish : A language engineering perspective
  • 2004
  • Ingår i: Natural Language Engineering. - 1351-3249 .- 1469-8110. ; 1:1
  • Tidskriftsartikel (refereegranskat)abstract
    • This article describes the construction and performance of Granska – a surface-oriented system for grammar checking of Swedish text. With the use of carefully constructed error detection rules, written in a new structured rule language, the system can detect and suggest corrections for a number of grammatical errors in Swedish texts. In this article, we specifically focus on how erroneously split compounds and disagreement are handled in the rules. The system combines probabilistic and rule-based methods to achieve high efficiency and robustness. The error detection rules are optimized using statistics of part-of-speech bigrams and words in a way that each rule needs to be checked as seldom as possible. We have found that the Granska system with higher efficiency can achieve the same or better results than systems with conventional technology.
  •  
4.
  • Kann, Viggo (författare)
  • Folkets användning av Lexin - en resurs
  • 2004
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • Tjänsten Lexin on-line är oerhört populär: i genomsnitt görs mer än tre uppslagningar per sekund, dygnet runt. Denna popularitet är en stor resurs som kan utnyttjas på följande sätt: Om alla människor som slår upp ett ord erbjuds att svara på en enkel fråga om huruvida två ord är synonyma så kan man på kort tid bygga upp ett stort synonymlexikon. I artikeln beskrivs hur man kan gå tillväga för att genomföra detta.
  •  
5.
  • Rosell, Magnus, et al. (författare)
  • Comparing Comparisons: Document Clustering Evaluation Using Two Manual Classifications
  • 2004
  • Konferensbidrag (refereegranskat)abstract
    • “Describe your occupation in a few words”, is a question answered by 44 000 Swedish twins.Each respondent was then manually categorized according to two established occupation classificationsystems. Would a clustering algorithm have produced satisfactory results? Usually,this question cannot be answered. The existing quality measures will tell us how much thealgorithmic clustering deviates from the manual classification, not if this is an acceptable deviation. But in our situation, with two different manual classifications (in classificationsystems called AMSYK and YK80), we can indeed construct such quality measures. If the algorithmic result differs no more from the manual classifications than these differ from eachother (comparing the comparisons) we have an indication of its being useful. Further, weuse the kappa coefficient as a clustering quality measure. Using one manual classification asa coding scheme we assess the agreement of a clustering and the other. After applying both these novel evaluation methods we conclude that our clusterings are useful.
  •  
6.
  • Sjöbergh, Jonas, et al. (författare)
  • Finding the correct interpretation of Swedish compounds, a statistical approach
  • 2004
  • Konferensbidrag (refereegranskat)abstract
    • This paper treats compound splitting for Swedish, where compounding is productive and very common. A method for splitting compounds and several methods for choosing the correct interpretation of ambiguous compounds are presented. 99% of all compounds are split, 97% of these are correctly interpreted.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-6 av 6

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