Java language conversion

Question

this is code I am using to translate some text to English from pig Latin and vice versa. Except the fromPig method does not seem to be working correctly.

Expected output: "java is a wonderful programming language, and object oriented programming is the best thing after sliced bread."

Got output: "avajavajay isyisyay ayay onderfulwonderfulway ogrammingprogrammingpray..."

So you can see that the words are inside but I need to get rid of the other parts on the ends of the word. Please try to provide code if you can fixing my mistake.

public class PigLatin {
    public String fromPig(String pigLatin) {
        String res="";
        String[] data=pigLatin.split(" ");
        for(String word : data)
        res += toEnglishWord(word) + " ";
        return res;
    }

    private String toEnglishWord(String word) {
        char punc=0;
        for(int i=0;i



This is the class that needs to execute the sentences.

public class Convert {
    public static void main(String args []) {
        PigLatin demo=new PigLatin();
        String inEnglish="Now is the winter of our discontent " +
            "Made glorious summer by this sun of York; " +
            "And all the clouds that lour'd upon our house " +
            "In the deep bosom of the ocean buried.";
        String inPigLatin="avajay isyay ayay onderfulway ogrammingpray " +
            "anguagelay, andyay objectyay orientedyay ogrammingpray " +
            "isyay hetay estbay ingthay afteryay icedslay eadbray.";
        System.out.println(demo.toPig(inEnglish));
        System.out.println(demo.fromPig(inPigLatin));
    }
}      


Basically the english sentence needs to be converted to pig latin and the pig latin sentence needs to be converted to english. 

English to piglatin is being done correctly. But piglatin to english is not.

user · Accepted Answer

It's impossible to convert Pig Latin to English just like that - you need a human, a program with access to a database of words, or a neural net or something that's been trained on a database of words. Without that, you will only be convert words back to English if they originally started with a vowel or their first letter was a consonant and their second letter was a vowel. Otherwise, there is literally no way for a machine to tell where the word originally ended.

For that reason, you need to make a method that outputs a List like this:

public static List allPossibleSentences(String inPigLatin) {
    List pigWords = Arrays.asList(inPigLatin.split("\s"));
    //You can also use a method reference here
    List> possSentences = cartesianProduct(pigWords.stream().map(word -> possibleEnglishWords(word)).collect(Collectors.toList()));
    return possSentences.stream().map(words -> String.join(" ", words)).collect(Collectors.toList());
  }

But since you need a fromPig method in your code, you can write it like this:

public static String fromPig(String inPigLatin) {
  return allPossibleSentences(inPigLatin).get(0);
}

This is overpowered, compared to the answer by Arvind Kumar Avinash, since it generates all permutations, but I feel it will be more useful if you have the most likely case and all possible sentences.

Example main method

public static void main(String[] args) {
    String inPigLatin="avajay isyay ayay onderfulway ogrammingpray " +
            "anguagelay andyay objectyay orientedyay ogrammingpray " +
            "isyay hetay estbay ingthay afteryay icedslay eadbray";
    System.out.println(fromPig(inPigLatin));
    inPigLatin = "icedslay eadbray";
    System.out.println("
Expected = sliced bread, gotten = " + fromPig(inPigLatin));
    System.out.println(String.join("
", allPossibleSentences(inPigLatin)));
}

Example output

java is a wonderful rogrammingp language and object oriented rogrammingp is the best hingt after liceds readb

Expected = sliced bread, gotten = liceds readb
liceds readb
liceds bread
liceds dbrea
sliced readb
sliced bread //Here you have the right answer, but your method has no way to confirm that
sliced dbrea
dslice readb
dslice bread
dslice dbrea

Your PigLatin class now

import java.util.Arrays;
import java.util.List;
import java.util.ArrayList;
import java.util.stream.Collectors;

class PigLatin {

//Put your toPig and toPigWord methods here (I couldn't find them)

public static String fromPig(String inPigLatin) {
  return allPossibleSentences(inPigLatin).get(0);
}

/* Methods that above code relies on */
private static List possibleEnglishWords(String word) {
    List possibilities = new ArrayList<>();
    if (word.matches(".*yay$")) {
      possibilities.add(word.substring(0, word.length() - 3));
      return possibilities;
    }

    //Remove the pig latin part
    word = word.substring(0, word.length() - 2);
    for (int i = word.length() - 1; i >= 0; i --) {
      if (isVowel(word.charAt(i))) break;
      if (word == "anguagel") System.out.println("char = " + word.charAt(i));
      possibilities.add(word.substring(i) + word.substring(0, i));
    }
    return possibilities;
  }

  //Put all the words together
  public static List> cartesianProduct(List> possWordArr) {
      if (possWordArr.size() == 1) {
        List> possSentencesAsWords = new ArrayList<>();
        possSentencesAsWords.add(possWordArr.get(0));
        return possSentencesAsWords;
      }
      return _cartesianProduct(0, possWordArr);
  }

  //Helper method
  private static List> _cartesianProduct(int index, List> possWordArr) {
      List> ret = new ArrayList<>();
      if (index == possWordArr.size()) {
          ret.add(new ArrayList<>());
      } else {
          for (String word : possWordArr.get(index)) {
              for (List words : _cartesianProduct(index + 1, possWordArr)) {
                  words.add(0, word);
                  ret.add(words);
              }
          }
      }
      return ret;
  }

  private static boolean isVowel(char c) {
    c = toUppercase(c);
    switch (c) {
      case 'A':
      case 'E':
      case 'I':
      case 'O':
      case 'U':
        return true;
      default:
        return false;
    }
  }

  private static char toUppercase(char c) {
    if (c >= 'a') return (char) (((char) (c - 'a')) + 'A');
    else return c;
  }
}

Java language conversion

Answers (2)

Related Questions