if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); return; buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); matches.add(new RankedWordProposal(buffer.toString(), -distance)); minimum= distance;
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); return; buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); matches.add(new RankedWordProposal(buffer.toString(), -distance)); minimum= distance;
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); return; buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); matches.add(new RankedWordProposal(buffer.toString(), -distance)); minimum= distance;