Speller Test Results for: «sp-baseform-pl-sma.txt»
Overview
Technical data
Language tested: sma
Document tested: sp-baseform-pl-sma.txt
Speller tool: Polderland command line tool
Speller tool version: spellSamiSout version 103.3.0.4, Mar 23 2009, 13:54:42
Speller lexicon version: Åarjelsaemien, version 1.2, 20120207-53682
Test Date: 20120207-1311
Test Type: baseform
Processing time (user+system time): No data available
Speed: No data available
Max memory usage of the speller (max value of /bin/ps -o rss= PID sampled every 10 second): No data available
Result summary
Nº of input words: 0
Nº of spelling errors: 0 (NaN of all words)
| Speller view | Wrong tokenisation | |||
|---|---|---|---|---|
| Speller Positive (Nº of flagged words): 0 | Speller Negative (Nº of accepted words): 0 | All tokenisation errors: 0 |
||
| Reality | Nº of real errors: 0 | Nº of true positives (detected real errors): 0 | Nº of false negatives (unflagged spelling errors): 0 | Nº of errouneously tokenized spelling errors: 0 |
| Nº of real correct words: 0 | Nº of false positives (incorrectly flagged words): 0 | Nº of true negatives (unflagged correct words): 0 | Nº of errouneously tokenized correct words: 0 |
|
Precision (tp/(tp+fp)):
NaN
Recall (tp/(tp+fn)):
NaN
Accuracy ((tp+tn)/words):
NaN
| Spelling errors: 0 | ||||
|---|---|---|---|---|
| Simple errors (edit dist. 1): | Errors with edit distance 2: | Errors with edit distance ≥3: |
||
| Suggestion statistics for true positives (= 0 = 100%): | 0 (NaN) | 0 (NaN) | 0 (NaN) | |
| Nº of detected spelling errors with correct suggestion in top 3: | 0 (NaN %) | 0 | 0 | 0 |
| Nº of detected spelling errors with correct suggestionbelow top 3: | 0 (NaN %) | 0 | 0 | 0 |
| Nº of detected spelling errors with only wrong suggestions: | 0 (NaN %) | 0 | 0 | 0 |
| Nº of detected spelling errors with no suggestions at all: | 0 (NaN %) | 0 | 0 | 0 |
| Undetected spelling errors: | 0 | 0 | 0 | 0 |
True negatives (0)
The correctly accepted words are listed here for easy copy&paste into Word to quick check regressions in new versions of the speller: No correctly spelled words accepted by an earlier speller should be rejected by later spellers. To check, just copy and paste these words to Word, and see if you get any red underlines. Duplicate words are not repeated, unless one is followed by some punctuation. The words are reverse sorted according to Unicode character code.