Letter case handling - Revision history

Bech: Link to French page

2014-10-08T07:13:02Z

Link to French page

Bech: Documentation in English

2011-09-03T18:34:53Z

Documentation in English

Unhammer at 14:41, 11 June 2010

2010-06-11T14:41:47Z

Unhammer at 14:38, 11 June 2010

2010-06-11T14:38:44Z

Unhammer at 14:28, 11 June 2010

2010-06-11T14:28:36Z

Unhammer: /* Examples */

2010-06-11T14:25:54Z

Examples

Francis Tyers: /* Examples */

2010-06-11T13:34:53Z

Examples

Francis Tyers: /* Examples */

2010-06-11T13:33:22Z

Examples

Francis Tyers: /* Examples */

2007-12-08T19:57:42Z

Examples

Francis Tyers: /* Examples */

2007-12-08T11:24:28Z

Examples

← Older revision		Revision as of 07:13, 8 October 2014
Line 1:		Line 1:
			[[Support des majuscules et minuscules\|En français]]

	The same input word in a lexical processing module can be written differently regarding letter case. The most frequent cases are:		The same input word in a lexical processing module can be written differently regarding letter case. The most frequent cases are:

@@ Line 103: / Line 103: @@
 [[Category:Documentation]]
 [[Category:Letter case|*]]
+[[Category:Documentation in English]]

← Older revision		Revision as of 14:41, 11 June 2010
Line 102:		Line 102:

	[[Category:Documentation]]		[[Category:Documentation]]
	[[Category:Letter case]]		[[Category:Letter case\|*]]

@@ Line 74: / Line 74: @@
 |-
 |}
+==Keeping dictionary case==
+By giving the <code>-w</code> (or <code>--dictionary-case</code>) option to lt-proc, the letter case normalisation doesn't happen, so eg. "BeeR" will get the analysis <code>^BeeR/beer<n><sg>$</code>. This is useful in connection with [[Constraint Grammar]]. If case is normalised by lt-proc, rules which refer to the lemma "beer" would have to also refer to "BeeR" (and "BeEr" and "bEEr" etc, typically using the case insensitivity option, which slows down analysis). By using <code>-w</code>, the lemma keeps dictionary case after analysis.
+However, we do want letter case normalisation before transfer; fortunately cg-proc can do this for us, just pass the <code>-w</code> (or <code>--wordform-case</code>) option to cg-proc. The end result should be the same as when just running lt-proc alone.
+===How acronyms are dealt with===
+The cg-proc -w option already outputs this:
+<pre>
+in: JEG/jeg<prn>, out: JEG/JEG<prn>
+in: JeG/jeg<prn>, out: JeG/JEG<prn>
+in: jeG/jeg<prn>, out: jeG/jeg<prn>
+in: Jeg/jeg<prn>, out: Jeg/Jeg<prn>
+in: jeg/jeg<prn>, out: jeg/jeg<prn>
+</pre>
+But we can't just look at the first and last character if the lemma is eg. an acronym, we have to look at the first '''lowercase character''' in the lemma (baseform):
+# in: bcg-vaksine/BCG-vaksine<n><m><sg><ind> out: bcg-vaksine/BCG-vaksine
+# in: BCG-vaksine/BCG-vaksine<n><m><sg><ind> out: bcg-vaksine/BCG-vaksine
+# in: BCG-VAKSINE/BCG-vaksine<n><m><sg><ind> out: bcg-vaksine/BCG-VAKSINE
+# in: Bcg-vaksine/BCG-vaksine<n><m><sg><ind> out: bcg-vaksine/BCG-vaksine
+# in: Bcg-Vaksine/BCG-vaksine<n><m><sg><ind> out: bcg-vaksine/BCG-Vaksine
+so in 3. above, the first lowercase character is the 'v', if _that_ one is uppercased and the final one is, we uppercase. If that one is uppercased while the final one is lowercased, as in 5 above, we capitalise.
 [[Category:Documentation]]

← Older revision		Revision as of 14:28, 11 June 2010
Line 76:		Line 76:

	[[Category:Documentation]]		[[Category:Documentation]]
			[[Category:Letter case]]

@@ Line 42: / Line 42: @@
 |-
 | beeR   || beer    || <code>^beeR/beer<n><sg>$</code>
+|-
+| BeeR   || beer    || <code>^BeeR/BEER<n><sg>$</code>
+|-
+| BeEr   || beer    || <code>^BeEr/Beer<n><sg>$</code>
 |-
 | IBM   || IBM    || <code>^IBM/IBM<np><org><sg>$</code>

@@ Line 21: / Line 21: @@
 ==Examples==
-Given the examples above in the dictionary in the case in which they are shown.
+Given the examples above, and the dictionary which makes the <code>lt-expand</code> output that follows,
+<pre>
-:'*' denotes unanalysed (unknown word)
+beer:beer<n><sg>
+IBM:IBM<np><org><sg>
+Peter:Peter<np><ant><m><sg>
+LaTeX:LaTeX<np><al><sg>
+</pre>
+The following table gives the analyses that would be output in regular case-handling mode.
 {|class=wikitable

@@ Line 36: / Line 36: @@
 | beeR   || beer    || <code>^beeR/beer<n><sg>$</code>
 |-
-| IBM   || IBM    || <code>^IBM/IBM<noun><singular>$</code>
+| IBM   || IBM    || <code>^IBM/IBM<np><org><sg>$</code>
 |-
 | ibm   || IBM    || <code>^ibm/*ibm$</code>
@@ Line 44: / Line 44: @@
 | IBm   || IBM    || <code>^IBm/*IBm$</code>
 |-
-| Peter   || Peter    || <code>^Peter/Peter<n><sg>$</code>
+| Peter   || Peter    || <code>^Peter/Peter<np><ant><m><sg>$</code>
 |-
 | peter   || Peter    || <code>^peter/*peter$</code>
 |-
-| PEter   || Peter    || <code>^PEter/PEter<n><sg>$</code>
+| PEter   || Peter    || <code>^PEter/PEter<np><ant><m><sg>$</code>
 |-
-| PETER   || Peter    || <code>^PETER/PETER<n><sg>$</code>
+| PETER   || Peter    || <code>^PETER/PETER<np><ant><m><sg>$</code>
 |-
-| LaTeX   || LaTeX    || <code>^LaTeX/LaTeX<n><sg>$</code>
+| LaTeX   || LaTeX    || <code>^LaTeX/LaTeX<np><al><sg>$</code>
 |-
 | LateX   || LaTeX    || <code>^LateX/*LateX$</code>
@@ Line 60: / Line 60: @@
 | latex   || LaTeX    || <code>^latex/*latex$</code>
 |-
-| LATEX   || LaTeX    || <code>^LATEX/LATEX<n><sg>$</code>
+| LATEX   || LaTeX    || <code>^LATEX/LATEX<np><al><sg>$</code>
 |-
 |}