Updated the translation tool to accept Tibetan Unicode. For the application version, this means that the smart paste is unicode aware and will do the appropriate conversion. In the servlet version tibetan unicode can now be inputted in the form and tibetan machine uni is used to display the results.
The Manipulate class now includes: acipToWylie, wylieToAcip, and unicodeToWylie. They provide a simple interfase to David Chandler's converters that are used by the translation tool.
This commit is contained in:
amontano
parent
2a47ff68a4
commit
67bddb7a7e
6 changed files with 851 additions and 717 deletions
|
|
@ -1,44 +1,44 @@
|
|||
/*
|
||||
The contents of this file are subject to the AMP Open Community License
|
||||
Version 1.0 (the "License"); you may not use this file except in compliance
|
||||
with the License. You may obtain a copy of the License on the AMP web site
|
||||
(http://www.tibet.iteso.mx/Guatemala/).
|
||||
|
||||
Software distributed under the License is distributed on an "AS IS" basis,
|
||||
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
|
||||
License for the specific terms governing rights and limitations under the
|
||||
License.
|
||||
|
||||
The Initial Developer of this software is Andres Montano Pellegrini. Portions
|
||||
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
|
||||
Pellegrini. All Rights Reserved.
|
||||
|
||||
Contributor(s): ______________________________________.
|
||||
*/
|
||||
The contents of this file are subject to the AMP Open Community License
|
||||
Version 1.0 (the "License"); you may not use this file except in compliance
|
||||
with the License. You may obtain a copy of the License on the AMP web site
|
||||
(http://www.tibet.iteso.mx/Guatemala/).
|
||||
|
||||
Software distributed under the License is distributed on an "AS IS" basis,
|
||||
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
|
||||
License for the specific terms governing rights and limitations under the
|
||||
License.
|
||||
|
||||
The Initial Developer of this software is Andres Montano Pellegrini. Portions
|
||||
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
|
||||
Pellegrini. All Rights Reserved.
|
||||
|
||||
Contributor(s): ______________________________________.
|
||||
*/
|
||||
|
||||
package org.thdl.tib.scanner;
|
||||
import java.util.Enumeration;
|
||||
import java.util.Vector;
|
||||
|
||||
/** Loads dictionary stored in tree format and searches for words recursively.
|
||||
How the the dictionary is loaded depends on which implementation of
|
||||
{@link SyllableListTree} is invoked.
|
||||
|
||||
@author Andrés Montano Pellegrini
|
||||
@see SyllableListTree
|
||||
*/
|
||||
How the the dictionary is loaded depends on which implementation of
|
||||
{@link SyllableListTree} is invoked.
|
||||
|
||||
@author Andrés Montano Pellegrini
|
||||
@see SyllableListTree
|
||||
*/
|
||||
public class LocalTibetanScanner extends TibetanScanner
|
||||
{
|
||||
public static String archivo;
|
||||
private SyllableListTree raiz, silActual, lastCompSil, silAnterior;
|
||||
private String wordActual, lastCompWord;
|
||||
private Vector floatingSil;
|
||||
|
||||
|
||||
static
|
||||
{
|
||||
archivo = null;
|
||||
}
|
||||
|
||||
|
||||
public BitDictionarySource getDictionarySource()
|
||||
{
|
||||
return raiz.getDictionarySourcesWanted();
|
||||
|
|
@ -46,12 +46,12 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
|
||||
public LocalTibetanScanner(String arch) throws Exception
|
||||
{
|
||||
this (arch, true);
|
||||
this (arch, true);
|
||||
}
|
||||
|
||||
|
||||
public LocalTibetanScanner(String arch, boolean backwardCompatible) throws Exception
|
||||
{
|
||||
super();
|
||||
super();
|
||||
archivo = arch;
|
||||
// raiz = new MemorySyllableListTree(archivo);
|
||||
// raiz = new FileSyllableListTree(archivo);
|
||||
|
|
@ -59,13 +59,13 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
floatingSil = new Vector();
|
||||
resetAll();
|
||||
}
|
||||
|
||||
|
||||
private void resetAll()
|
||||
{
|
||||
silAnterior = silActual = lastCompSil = null;
|
||||
wordActual = lastCompWord = null;
|
||||
}
|
||||
|
||||
|
||||
private void scanSyllable(String sil)
|
||||
{
|
||||
SyllableListTree resultado=null;
|
||||
|
|
@ -73,13 +73,13 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
Word w;
|
||||
String silSinDec;
|
||||
boolean aadded;
|
||||
|
||||
|
||||
if (silActual==null)
|
||||
silActual = raiz;
|
||||
|
||||
|
||||
silAnterior = silActual;
|
||||
silActual = silActual.lookUp(sil);
|
||||
|
||||
|
||||
if (silActual != null)
|
||||
{
|
||||
if (silActual.hasDef())
|
||||
|
|
@ -113,9 +113,9 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
}
|
||||
else
|
||||
{
|
||||
resultado = null;
|
||||
if (aadded) silSinDec = silSinDec.substring(0, silSinDec.length()-1);
|
||||
silSinDec = withOutDec(silSinDec);
|
||||
resultado = null;
|
||||
if (aadded) silSinDec = silSinDec.substring(0, silSinDec.length()-1);
|
||||
silSinDec = withOutDec(silSinDec);
|
||||
}
|
||||
}
|
||||
if (resultado!=null) return;
|
||||
|
|
@ -134,9 +134,9 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
{
|
||||
resultado = silAnterior.lookUp(silSinDec);
|
||||
/* here we don't have to worry about being in the middle of a
|
||||
word since the declension marks that it is the end of a
|
||||
word.
|
||||
*/
|
||||
word since the declension marks that it is the end of a
|
||||
word.
|
||||
*/
|
||||
if (resultado == null || !resultado.hasDef())
|
||||
{
|
||||
silSinDec += "\'";
|
||||
|
|
@ -153,26 +153,26 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
}
|
||||
else
|
||||
{
|
||||
resultado = null;
|
||||
if (aadded) silSinDec = silSinDec.substring(0, silSinDec.length()-1);
|
||||
silSinDec = withOutDec(silSinDec);
|
||||
resultado = null;
|
||||
if (aadded) silSinDec = silSinDec.substring(0, silSinDec.length()-1);
|
||||
silSinDec = withOutDec(silSinDec);
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
if (resultado!=null) return;
|
||||
|
||||
if (lastCompSil!=null)
|
||||
{
|
||||
if (lastCompWord.equals(wordActual)) w = new Word(lastCompWord, lastCompSil.getDefs());
|
||||
if (lastCompWord.equals(wordActual)) w = new Word(lastCompWord, lastCompSil.getDefs());
|
||||
else w = new Word(lastCompWord, wordActual, lastCompSil.getDefs());
|
||||
wordList.addLast(w);
|
||||
this.resetAll();
|
||||
|
||||
|
||||
enumeration = floatingSil.elements();
|
||||
floatingSil = new Vector();
|
||||
while (enumeration.hasMoreElements())
|
||||
scanSyllable((String)enumeration.nextElement());
|
||||
|
||||
|
||||
scanSyllable(sil);
|
||||
}
|
||||
else
|
||||
|
|
@ -193,32 +193,32 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public void finishUp()
|
||||
{
|
||||
Enumeration enumeration;
|
||||
Word w;
|
||||
|
||||
|
||||
while (lastCompSil!=null)
|
||||
{
|
||||
if (lastCompWord.equals(wordActual)) w = new Word(lastCompWord, lastCompSil.getDefs());
|
||||
else w = new Word(lastCompWord, wordActual, lastCompSil.getDefs());
|
||||
wordList.addLast(w);
|
||||
this.resetAll();
|
||||
|
||||
|
||||
enumeration = floatingSil.elements();
|
||||
floatingSil = new Vector();
|
||||
while (enumeration.hasMoreElements())
|
||||
scanSyllable((String)enumeration.nextElement());
|
||||
}
|
||||
|
||||
|
||||
if (silActual!=null)
|
||||
{
|
||||
wordList.addLast(new Word(wordActual, "[incomplete word]"));
|
||||
this.resetAll();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
private static String concatWithSpace(String s1, String s2)
|
||||
{
|
||||
if (s1==null || s1.equals(""))
|
||||
|
|
@ -226,14 +226,14 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
else
|
||||
return s1 + ' ' + s2;
|
||||
}
|
||||
|
||||
|
||||
private static String withOutDec(String sil)
|
||||
{
|
||||
boolean isDeclined =false;
|
||||
int len = sil.length(), apos;
|
||||
|
||||
|
||||
if (len<3) return null;
|
||||
|
||||
|
||||
char lastCar = Character.toLowerCase(sil.charAt(len-1));
|
||||
if ((lastCar == 's' || lastCar == 'r') && Manipulate.isVowel(sil.charAt(len-2)))
|
||||
{
|
||||
|
|
@ -242,19 +242,19 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
}
|
||||
else
|
||||
{
|
||||
apos = sil.lastIndexOf('\'');
|
||||
if (apos>0 && apos < len-1 && Manipulate.isVowel(sil.charAt(apos-1)) && sil.charAt(apos+1)!='u')
|
||||
{
|
||||
isDeclined=true;
|
||||
sil = sil.substring(0, apos);
|
||||
}
|
||||
/* if ((lastCar == 'i' || lastCar == 'o') && sil.charAt(len-2)=='\'')
|
||||
{
|
||||
isDeclined=true;
|
||||
sil = sil.substring(0, len-2);
|
||||
}*/
|
||||
apos = sil.lastIndexOf('\'');
|
||||
if (apos>0 && apos < len-1 && Manipulate.isVowel(sil.charAt(apos-1)) && sil.charAt(apos+1)!='u')
|
||||
{
|
||||
isDeclined=true;
|
||||
sil = sil.substring(0, apos);
|
||||
}
|
||||
/* if ((lastCar == 'i' || lastCar == 'o') && sil.charAt(len-2)=='\'')
|
||||
{
|
||||
isDeclined=true;
|
||||
sil = sil.substring(0, len-2);
|
||||
}*/
|
||||
}
|
||||
|
||||
|
||||
if (!isDeclined) return null;
|
||||
return sil;
|
||||
}
|
||||
|
|
@ -262,127 +262,127 @@ public class LocalTibetanScanner extends TibetanScanner
|
|||
public void scanBody(String in)
|
||||
{
|
||||
boolean hayMasLineas=true;
|
||||
|
||||
|
||||
if (in.equals("")) finishUp();
|
||||
else
|
||||
{
|
||||
int init = 0, fin;
|
||||
String linea;
|
||||
|
||||
|
||||
while (hayMasLineas)
|
||||
{
|
||||
fin = in.indexOf("\n",init);
|
||||
if (fin<0)
|
||||
{
|
||||
linea = in.substring(init).trim();
|
||||
hayMasLineas=false;
|
||||
linea = in.substring(init).trim();
|
||||
hayMasLineas=false;
|
||||
}
|
||||
else
|
||||
linea = in.substring(init, fin).trim();
|
||||
|
||||
linea = in.substring(init, fin).trim();
|
||||
|
||||
if (linea.equals(""))
|
||||
{
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark('\n'));
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark('\n'));
|
||||
}
|
||||
else
|
||||
scanLine(linea);
|
||||
|
||||
scanLine(linea);
|
||||
|
||||
init = fin+1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public void scanLine(String linea)
|
||||
{
|
||||
int init = 0, fin;
|
||||
char ch;
|
||||
String sil;
|
||||
boolean doNotFinishUp;
|
||||
|
||||
|
||||
if (linea.equals(""))
|
||||
{
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark('\n'));
|
||||
return;
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark('\n'));
|
||||
return;
|
||||
}
|
||||
|
||||
outAHere:
|
||||
while(true)
|
||||
{
|
||||
doNotFinishUp=true;
|
||||
|
||||
// Make init skip all punctuation marks
|
||||
while (true)
|
||||
|
||||
outAHere:
|
||||
while(true)
|
||||
{
|
||||
if (init>=linea.length())
|
||||
break outAHere;
|
||||
ch = linea.charAt(init);
|
||||
if (Manipulate.isPunctuationMark(ch))
|
||||
{
|
||||
if (doNotFinishUp)
|
||||
{
|
||||
finishUp();
|
||||
doNotFinishUp=false;
|
||||
}
|
||||
wordList.addLast(new PunctuationMark(ch));
|
||||
}
|
||||
else if (!Manipulate.isEndOfSyllableMark(ch))
|
||||
break;
|
||||
|
||||
init++;
|
||||
}
|
||||
|
||||
doNotFinishUp = true;
|
||||
|
||||
/* move fin to the end of the next syllable. If finishing
|
||||
up is necessary it is done after scanSyllable
|
||||
*/
|
||||
|
||||
fin = init+1;
|
||||
while (fin < linea.length())
|
||||
{
|
||||
ch = linea.charAt(fin);
|
||||
if (Manipulate.isPunctuationMark(ch))
|
||||
{
|
||||
doNotFinishUp = false;
|
||||
break;
|
||||
}
|
||||
else if (Manipulate.isEndOfSyllableMark(ch))
|
||||
{
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
fin++;
|
||||
if (fin>=linea.length())
|
||||
break;
|
||||
doNotFinishUp=true;
|
||||
|
||||
// Make init skip all punctuation marks
|
||||
while (true)
|
||||
{
|
||||
if (init>=linea.length())
|
||||
break outAHere;
|
||||
ch = linea.charAt(init);
|
||||
if (Manipulate.isPunctuationMark(ch))
|
||||
{
|
||||
if (doNotFinishUp)
|
||||
{
|
||||
finishUp();
|
||||
doNotFinishUp=false;
|
||||
}
|
||||
wordList.addLast(new PunctuationMark(ch));
|
||||
}
|
||||
else if (!Manipulate.isEndOfSyllableMark(ch))
|
||||
break;
|
||||
|
||||
init++;
|
||||
}
|
||||
|
||||
doNotFinishUp = true;
|
||||
|
||||
/* move fin to the end of the next syllable. If finishing
|
||||
up is necessary it is done after scanSyllable
|
||||
*/
|
||||
|
||||
fin = init+1;
|
||||
while (fin < linea.length())
|
||||
{
|
||||
ch = linea.charAt(fin);
|
||||
if (Manipulate.isPunctuationMark(ch))
|
||||
{
|
||||
doNotFinishUp = false;
|
||||
break;
|
||||
}
|
||||
else if (Manipulate.isEndOfSyllableMark(ch))
|
||||
{
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
fin++;
|
||||
if (fin>=linea.length())
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
sil = linea.substring(init, fin);
|
||||
scanSyllable(sil);
|
||||
|
||||
if (!doNotFinishUp)
|
||||
{
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark(ch));
|
||||
}
|
||||
init = fin+1;
|
||||
}
|
||||
|
||||
sil = linea.substring(init, fin);
|
||||
scanSyllable(sil);
|
||||
|
||||
if (!doNotFinishUp)
|
||||
{
|
||||
finishUp();
|
||||
wordList.addLast(new PunctuationMark(ch));
|
||||
}
|
||||
init = fin+1;
|
||||
}
|
||||
}
|
||||
|
||||
/** Looks for .dic file, and returns the dictionary descriptions.
|
||||
Also updates the definitionTags in the Definitions class.
|
||||
*/
|
||||
public String[] getDictionaryDescriptions()
|
||||
{
|
||||
return FileSyllableListTree.getDictionaryDescriptions(archivo);
|
||||
}
|
||||
|
||||
public void destroy()
|
||||
{
|
||||
FileSyllableListTree.closeFiles();
|
||||
}
|
||||
|
||||
/** Looks for .dic file, and returns the dictionary descriptions.
|
||||
Also updates the definitionTags in the Definitions class.
|
||||
*/
|
||||
public String[] getDictionaryDescriptions()
|
||||
{
|
||||
return FileSyllableListTree.getDictionaryDescriptions(archivo);
|
||||
}
|
||||
|
||||
public void destroy()
|
||||
{
|
||||
FileSyllableListTree.closeFiles();
|
||||
}
|
||||
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue